#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 1e5+10;
const int mod = 998244353;
const int inv2 = mod + 1>>1;

int len,rev[N<<2],n,m,c[N];
ll A[N<<2],B[N<<2],G[N<<2],sqG[N<<2],Wn[N<<2],a[N<<2];

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod)if(t&1)res=res*x%mod;return res;}

void init_NTT(int l){
	for(len = 1;len < l << 1;len<<=1);
	for(int i = 1;i < len;i++) rev[i] = rev[i>>1]>>1 | (i & 1 ? len >> 1 : 0);
}

void NTT(ll *f,int on = 1){
	for(int i = 1;i < len;i++) if(i < rev[i]) swap(f[i],f[rev[i]]);
	for(int h = 2;h <= len;h <<= 1){
		ll wn = Wn[h];
		for(int i = 0;i < len;i+=h){
			ll ww = 1;
			for(int k = i;k < i + h/2;k++){
				ll u = f[k],v = f[k+h/2] * ww % mod; ww = ww * wn % mod;
				f[k] = (u + v) % mod,f[k+h/2] = (u - v + mod) % mod;
			}
		}
	}
	if(on == -1){reverse(f+1,f+len); ll inv = qp(len,mod-2);for(int i = 0;i < len;i++) f[i] = f[i] * inv % mod;}
}

void getinv(int deg,ll *f,ll *g){
	if(deg == 1) return g[0] = qp(f[0],mod-2),void();
	getinv(deg+1>>1,f,g); init_NTT(deg);
	for(int i = 0;i < deg;i++) a[i] = f[i]; for(int i = deg;i < len;i++) a[i] = 0;
	NTT(a); NTT(g); for(int i = 0;i < len;i++) g[i] = g[i] * (2 - a[i] * g[i] % mod + mod) % mod; NTT(g,-1);
	for(int i = deg;i < len;i++) g[i] = 0;
}

void sqrt(int deg,ll *f,ll *g){
	if(deg == 1) return g[0] = 1,void();
	sqrt(deg+1>>1,f,g); for(int i = 0;i < len;i++) B[i] = 0; getinv(deg,g,B); init_NTT(deg); 
	for(int i = 0;i < deg;i++) A[i] = f[i]; for(int i = deg;i < len;i++) A[i] = 0;
	NTT(A); NTT(B); for(int i = 0;i < len;i++) A[i] = A[i] * B[i] % mod; NTT(A,-1);
	for(int i = 0;i < deg;i++) g[i] = inv2 * (g[i] + A[i]) % mod; for(int i = deg;i < len;i++) g[i] = 0;
}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in;
	for(int h = 1;h < N<<2;h <<= 1) Wn[h] = qp(3,(mod-1)/h);
	for(int i = 0,x;i < n;i++) c[x = in] = 1;
	G[0] = 1; for(int i = 1;i < N;i++) G[i] = (mod - 4 * c[i] % mod) % mod;
	sqrt(N-1,G,sqG) ;sqG[0]++; memset(G,0,sizeof(G));
	getinv(N-1,sqG,G); for(int i = 1;i <= m;i++) printf("%lld\n",G[i] * 2 % mod);
	return 0;
}

